A Graph Rewriting Semantics for the Polyadic Calculus
نویسنده
چکیده
We give a hypergraph rewriting semantics for the polyadic π-calculus, based on rewriting rules equivalent to those in the double-pushout approach. The structural congruence of the π-calculus is replaced by hypergraph isomorphism. The correctness of the encoding from the graph-based notation into π-calculus can be shown by using an intermediate notation, so-called name-based graph terms.
منابع مشابه
Graph Rewriting for the π - calculus †
We propose a graphical implementation for (possibly recursive) processes of the π-calculus, encoding each process into a graph. Our implementation is sound and complete with respect to the structural congruence for the calculus: Two processes are equivalent if and only if they are mapped into graphs with the same normal form. Most importantly, the encoding allows the use of standard graph rewri...
متن کاملGraph Types for Monadic Mobile Processes
While types for name passing calculi have been studied extensively in the context of sorting of polyadic π-calculus [26, 7, 43, 11, 36, 41, 24, 42, 14, 22], the type abstraction on the corresponding level is not possible in the monadic setting, which was left as an open issue by Milner [26]. We solve this problem with an extension of sorting which captures dynamic aspects of process behaviour i...
متن کاملTowards a Sharing Strategy for the Graph Rewriting Calculus
The graph rewriting calculus is an extension of the ρ-calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using unification constraints in addition to the standard ρ-calculus matching constraints. The transformations are performed by explicit application of rewrite rules as first class entities. The possibility of expressing sha...
متن کاملPolyadic History-Dependent Automata for the Fusion Calculus
We extend History Dependent Automata to handle polyadic labels, and using a new symbolic semantics of fusion calculus we give a mapping into these Polyadic HDA with Negative Transitions, and show that the mapping is adequate with respect to hyperequivalence in the fusion calculus. This lays the grounds for HD-automata-based tools applicable not only to the monadic π-calculus but also to the fus...
متن کاملSharing in the Graph Rewriting Calculus
The graph rewriting calculus is an extension of the ρ-calculus, handling graph like structures, with explicit sharing and cycles, rather than simple terms. We study a reduction strategy for the graph rewriting calculus which is intended to maintain the sharing in the terms as long as possible. We show that the corresponding reduction relation is adequate w.r.t. the original semantics of the gra...
متن کامل